Towards a Taxonomy of Parallel Tabu Search Heuristics

نویسندگان

  • Teodor Gabriel Crainic
  • Michel Gendreau
چکیده

In this paper we present a classi cation of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures and, on the other hand, on how the search space is partitionned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is further illustrated by the results of several parallelization implementations of a tabu search procedure for multicommodity location-allocation problems with balancing requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward a Taxonomy of Parallel Tabu Search Heuristics

In this paper we present a classi cation of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures and, on the other hand, on how the search space is partitionned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is f...

متن کامل

Parallel Tabu Search for Optimizing the OSPF Weight Setting Problem

The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization o...

متن کامل

Parallel Heuristic Search - New Approaches to Parallel Simulated Annealing and Tabu Search

A large number of combinatorial optimization problems can presently only be solved to proven optimality if they are of very moderate size. This fact motivates the interest in approximation algorithms and heuristics. The former class of algorithms are able to guarantee the quality of the produced (suboptimal) solutions within certain bounds, while heuristics usually only have empirical evidence ...

متن کامل

Parallel Heuristics for TSP on MapReduce

We analyze the possibility of parallelizing the Traveling Salesman Problem over the MapReduce architecture. We present the serial and parallel versions of two algorithms Tabu Search and Large Neighborhood Search. We compare the best tour length achieved by the Serial version versus the best achieved by the MapReduce version. We show that Tabu Search and Large Neighborhood Search are not well su...

متن کامل

Cooperative Multi - Thread Parallel Tabu

In this work, we propose a cooperative multi-thread parallel tabu search heuristic for the circuit partitioning problem. This procedure is based on the cooperation of multiple search threads. Each thread implements a diierent variant of a sequential tabu search algorithm, using a diierent combination of initial solution algorithm and move attribute deenition. These threads communicate by exchan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997